Neighbor sum distinguishing total choosability of planar graphs without 4-cycles

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The 4-choosability of planar graphs without 6-cycles

Let G be a planar graph without 6-cycles. We prove that G is 4-choosable.

متن کامل

Choosability and edge choosability of planar graphs without five cycles

It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l)h c oosable. @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-Choosability, Edge choosability, Degeneracy, Planar graph.

متن کامل

On the Neighbor Sum Distinguishing Index of Planar Graphs

Let c be a proper edge colouring of a graph G = (V,E) with integers 1, 2, . . . , k. Then k ≥ ∆(G), while by Vizing’s theorem, no more than k = ∆(G)+ 1 is necessary for constructing such c. On the course of investigating irregularities in graphs, it has beenmoreover conjectured that only slightly larger k, i.e., k = ∆(G) + 2 enables enforcing additional strong feature of c, namely that it attri...

متن کامل

Group edge choosability of planar graphs without adjacent short cycles

In this paper, we aim to introduce the group version of edge coloring and list edge coloring, and prove that all 2-degenerate graphs along with some planar graphs without adjacent short cycles is group (∆(G) + 1)-edgechoosable while some planar graphs with large girth and maximum degree is group ∆(G)-edge-choosable.

متن کامل

Edge choosability of planar graphs without small cycles

We investigate structural properties of planar graphs without triangles or without 4-cycles, and show that every triangle-free planar graph G is edge-( (G) + 1)-choosable and that every planar graph with (G) = 5 and without 4-cycles is also edge-( (G) + 1)-choosable. c © 2003 Elsevier B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2016

ISSN: 0166-218X

DOI: 10.1016/j.dam.2016.02.003